3coSoKu and its declarative modeling

Abstract In this paper, we analyze the physical puzzle IcoSoKu, a game about placing some given triangular tiles on faces of an icosahedron in order to fill capacities its vertices, and propose generalization called 3coSoKu, admitting arbitrary playing field with faces, set tiles. First, prove strong NP-completeness even when is convex polyhedron equilateral triangles as faces. Second, encode 3coSoKu both constraint modeling language MiniZinc logic programming paradigm known Answer Set Programming develop visual tool for accessible interface solver. Finally, use our encodings verify experimentally that every initial state IcoSoKu admits solution.